An effective approach for mining mobile user habits.

Exploiting user interests for collaborative filtering interests expansion via personalized ranking.

Single and Multiple Device DSA Problem%2C Complexities and Online Algorithms.

Storage Device Performance Prediction with Selective Bagging Classification and Regression Tree.

Profit%2Dbased on%2Ddemand broadcast scheduling of real%2Dtime multi%2Ditem requests.

Context%2Daware ranking in web search.
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused on the development of context models or limited to a relatively small scale investigation under a controlled laboratory setting. Particularly, about context-aware ranking for Web search, the following two critical problems are largely remained unsolved. First, how can we take advantage of different types of contexts in ranking? Second, how can we integrate context information into a ranking model? In this paper, we tackle the above two essential problems analytically and empirically. We develop different ranking principles for different types of contexts. Moreover, we adopt a learning-to-rank approach and integrate the ranking principles into a state-of-the-art ranking model by encoding the context information as features of the model. We empirically test our approach using a large search log data set obtained from a major commercial search engine. Our evaluation uses both human judgments and implicit user click data. The experimental results clearly show that our context-aware ranking approach improves the ranking of a commercial search engine which ignores context information. Furthermore, our method outperforms a baseline method which considers context information in ranking.
Energy optimal schedules for jobs with multiple active intervals.

Enhancing recommender systems under volatile userinterest drifts.

Min%2DEnergy Scheduling for Aligned Jobs in Accelerate Model.

A Novel Nonparametric Regression Ensemble for Rainfall Forecasting Using Particle Swarm Optimization Technique Coupled with Artificial Neural Network.

Context%2Daware query classification.
Abstract. With more and more commercial activities moving onto the Internet, people tend to purchase what they need through Internet or conduct some online research before the actual transactions happen. For many Web users, their online commercial activities start from submitting a search query to search engines. Just like the common Web search queries, the queries with commercial intention are usually very short. Recognizing the queries with commercial intention against the common queries will help search engines provide proper search results and advertisements, help Web users obtain the right information they desire and help the advertisers benefit from the potential transactions. However, the intentions behind a query vary a lot for users with different background and interest. The intentions can even be different for the same user, when the query is issued in different contexts. In this paper, we present a new algorithm framework based on skip-chain conditional random field (SCCRF) for automatically classifying Web queries according to context-based online commercial intention. We analyze our algorithm performance both theoretically and empirically. Extensive experiments on several real search engine log datasets show that our algorithm can improve more than 10 % on F1 score than previous algorithms on commercial intention detection. 1
Towards context%2Daware search by learning a very large variable length hidden markov model from search logs.
Capturing the context of a user’s query from the previous queries and clicks in the same session may help understand the user’s information need. A context-aware approach to document re-ranking, query suggestion, and URL recommendation may improve users ’ search experience substantially. In this paper, we propose a general approach to context-aware search. To capture contexts of queries, we learn a variable length Hidden Markov Model (vlHMM) from search sessions extracted from log data. Although the mathematical model is intuitive, how to learn a large vlHMM with millions of states from hundreds of millions of search sessions poses a grand challenge. We develop a strategy for parameter initialization in vlHMM learning which can greatly reduce the number of parameters to be estimated in practice. We also devise a method for distributed vlHMM learning under the map-reduce model. We test our approach on a real data set consisting of 1.8 billion queries, 2.6 billion clicks, and 840 million search sessions, and evaluate the effectiveness of the vlHMM learned from the real data on three search applications: document re-ranking, query suggestion, and URL recommendation. The experimental results show that our approach is both effective and efficient.
Finding Community Structure Based on Subgraph Similarity

SPF%2DA%2A Searching Multimedia Data in Heterogeneous Mobile P2P Network.

Optimal tree structures for group key tree management considering insertion and deletion cost.

Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost.

Question recommendation for user%2Dinteractive question answering systems.

Optimal Key Tree Structure for Deleting Two or More Leaves.

Optimal Key Tree Structure for Deleting Two or More Leaves.

Context%2Daware query suggestion by mining click%2Dthrough and session data.
The Semantic Web is the extension of the World Wide Web that enables people to share content beyond the boundaries of applications and websites. As we can see that the current search engines play an important and central role in current web’s infrastructure, the document ranking algorithm is in the core of search engines. Similarly the
Adaptive caching with heterogeneous devices in mobile peer to peer network.

Adaptive label%2Ddriven scaling for latent semantic indexing.

Efficient strategies for tough aggregate constraint%2Dbased sequential pattern mining.

An evolution%2Dbased cache scheme for scalable mobile data access.

An answer passage retrieval strategy for web%2Dbased question answering.

Heuristic learning of rules for information extraction from web documents.

On the strength of hyperclique patterns for text categorization.

A Chord%2DBased Novel Mobile Peer%2Dto%2DPeer File Sharing Protocol.

Adapting association patterns for text categorization weaknesses and enhancements.

An Evolutionary Computational Method for N%2DConnection Subgraph Discovery.

A Novel Automatic Text Summarization Study Based on Term Co%2DOccurrence.

SIIPU%2AS A Semantic Pattern Learning Algorithm.

A Novel Approach of Table Detection and Analysis for Semantic Annotation.

Dynamic Clustering Using Multi%2Dobjective Evolutionary Algorithm.

A General Effective Framework for Monotony and Tough Constraint Based Sequential Pattern Mining.

SVM Based Automatic User Profile Construction for Personalized Search.

SVM Based Automatic User Profile Construction for Personalized Search.

An Ontology Learning Method Enhanced by Frame Semantics.
Ontology Learning is a method that can be used by ontology engineers to construct ontology more easily. With the rapid development of Semantic Web and the ever increasing need for ontology, Ontology Learning has been regarded as one of the most important fields in the Semantic Web related research work. In recent years, a lot of work has been done to design appropriate methods for ontology learning all over the world. But all these methods have some common shortcomings which limit their abilities. In this paper, we first analyze the characteristics of these shortcomings and then propose our own ontology learning method based on the theory of frame semantic which can overcome the shortcomings mentioned above and facilitate the ontology learning task. The experiment results show that this method could improve the performance of the ontology learning system. 1.
TextCC New Feed Forward Neural Network for Classifying Documents Instantly.

Efficient Incremental Pattern Mining from Semi%2Dstructured Dataset.

User%2DFocus Based Personalization Recommendation for Text Information Retrieval.

An Instance Learning Approach for Automatic Semantic Annotation.

Enabling Personalization Recommendation With WeightedFP for Text Information Retrieval Based on User%2DFocus.

Kansei%2DOriented Image Retrieval.

Semistructured Data Store Mapping with XML and Its Reconstruction.

Kansei%2DOriented Image Retrieval.

An Algorithm for Fast Recognition of Connected Row%2DConvex Constraint Networks.

Semi%2DStructured Data Extraction and Schema Knowledge Mining.

